Blind frame synchronization for error correcting codes having a sparse parity check matrix
نویسندگان
چکیده
منابع مشابه
Cascading parity-check error-correcting codes
A method for improving the performance of sparse-matrix based parity check codes is proposed, based on insight gained from methods of statistical physics. The advantages of this approach are demonstrated on an existing encoding/decoding paradigm suggested by Sourlas. We also discuss the application of the same method to more advanced codes of a similar type.
متن کاملCodes with a Circulant Parity Check Matrix
In this work we study codes characterized by the property that their parity check matrix is circulant, i.e., that rows are obtained as all the distinct cyclic shifts of the rst row. For these codes, we give simple expressions for their dimension and for a lower bound on their minimum distance. We also present an O(nd) algorithm to solve the problem of deciding whether codes satisfying given con...
متن کاملA Combined Matrix Ensemble of Low-Density Parity-Check Codes for Correcting a Solid Burst Erasure
A new ensemble of low-density parity-check (LDPC) codes for correcting a solid burst erasure is proposed. This ensemble is an instance of a combined matrix ensemble obtained by concatenating some LDPC matrices. We derive a new bound on the critical minimum span ratio of stopping sets for the proposed code ensemble by modifying the bound for ordinary code ensemble. By calculating this bound, we ...
متن کاملStatistical physics of regular low-density parity-check error-correcting codes
A variation of Gallager error-correcting codes is investigated using statistical mechanics. In codes of this type, a given message is encoded into a codeword that comprises Boolean sums of message bits selected by two randomly constructed sparse matrices. The similarity of these codes to Ising spin systems with random interaction makes it possible to assess their typical performance by analytic...
متن کاملStatistical mechanics of low-density parity check error-correcting codes over Galois fields
– A variation of low-density parity check (LDPC) error-correcting codes defined over Galois fields (GF (q)) is investigated using statistical physics. A code of this type is characterised by a sparse random parity check matrix composed of C non-zero elements per column. We examine the dependence of the code performance on the value of q, for finite and infinite C values, both in terms of the th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2009
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2009.06.070445